MacLane's planarity criterion for locally finite graphs
نویسندگان
چکیده
MacLane’s planarity criterion states that a finite graph is planar if and only if its cycle space has a basis B such that every edge is contained in at most two members of B. Solving a problem of Wagner (1970), we show that the topological cycle space introduced recently by Diestel and Kühn allows a verbatim generalisation of MacLane’s criterion to locally finite graphs. This then enables us to extend Kelmans’ planarity criterion as well.
منابع مشابه
MacLane's theorem for arbitrary surfaces
Given a closed surface S, we characterise the graphs embeddable in S by an algebraic condition asserting the existence of a sparse generating set for their cycle space. When S is the sphere, the condition defaults to MacLane’s planarity criterion.
متن کاملBicycles and left-right tours in locally finite graphs
We extend three results involving bicycles and left-right tours to infinite, locally finite graphs: Read and Rosenstiehl’s tripartition theorem, Shank’s theorem that the residues of left-right tours generate the bicycle space and the planarity criterion of Archdeacon, Bonnington and Little. In order to achieve this it is necessary to allow infinite cycles as defined by Diestel and Kühn.
متن کاملPlanarity and duality of finite and infinite graphs
We present a short proof of the following theorems simultaneously: Kuratowski’s theorem, Fary’s theorem, and the theorem of Tutte that every 3-connected planar graph has a convex representation. We stress the importance of Kuratowski’s theorem by showing how it implies a result of Tutte on planar representations with prescribed vertices on the same facial cycle as well as the planarity criteria...
متن کاملEnumerating planar locally finite Cayley graphs
We characterize the set of planar locally finite Cayley graphs, and give a finite representation of these graphs by a special kind of finite state automata called labeling schemes. As a result, we are able to enumerate and describe all planar locally finite Cayley graphs of a given degree. This analysis allows us to solve the problem of decision of the locally finite planarity for a word-proble...
متن کاملThe Cycle Space of an Infinite Graph
Finite graph homology may seem trivial, but for infinite graphs things become interesting. We present a new approach that builds the cycle space of a graph not on its finite cycles but on its topological circles, the homeomorphic images of the unit circle in the space formed by the graph together with its ends. Our approach permits the extension to infinite graphs of standard results about fini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 96 شماره
صفحات -
تاریخ انتشار 2006